Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup

نویسندگان

  • Yonit Bousany
  • Mary Leah Karker
  • Joseph O'Rourke
  • Leona Sparaco
چکیده

We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vectors. We characterize the optimal 2-sweeps of triangles, and provide a linear-time algorithm for convex polygons.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sweeping an oval to a vanishing point

Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweeps was first studied in [2]. Here we consider the following slanted variant of sweeping recently introduced in [1]: In a single sweep, the sweep-line is placed at a start position somewhere in the plane,...

متن کامل

Isoperimetric Triangular Enclosure with a Fixed Angle

Given a set S of n > 2 points in the plane (in general position), we show how to compute in O(n) time, a triangle T with maximum (or minimum) area enclosing S among all enclosing triangles with fixed perimeter P and one fixed angle ω. We show that a similar approach can be used to compute a triangle T with maximum (or minimum) perimeter enclosing S among all enclosing triangles with fixed area ...

متن کامل

On implementation of the minimal perimeter triangle enclosing a convex polygon algorithm

A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work. However, that implementation is incomplete and omits certain common cases. This note’s contribution consist of a modern treatment of the algorithm and its conseq...

متن کامل

Minimum-Perimeter Enclosing k-gon

Introduction Let P = p1, . . . , pn be a simple polygon (all polygons are assumed convex throughout this paper). A fundamental problem in geometric optimization is to compute a minimum-area or a minimum-perimeter convex k-gon (denoted QA or Qp, resp.) that encloses P . While efficient algorithms for finding QA are known for more than 20 years [8, 1, 2], the problem of finding Qp has remained op...

متن کامل

Eecient Parallel Algorithms for Geometric Clustering and Partitioning Problems

We present eecient parallel algorithms for some geometric clustering and partitioning problems. Our algorithms run in the CREW PRAM model of parallel computation. Given a point set P of n points in two dimensions, the clustering problems are to nd a k-point subset such that some measure for this subset is minimized. We consider the problems of nding a k-point subset with minimum L 1 perimeter a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010